Index coding with side information
نویسنده
چکیده
The Index Coding problem has attracted a considerable amount of attention in the recent years. The problem is motivated by several applications in wireless networking and distributed computing. An instance of the index coding problem includes a sender that holds an input x = (x1, x2, . . . , xn) ∈ {0, 1} and communicates with n receivers R1, . . . , Rn using wireless broadcast channel. Each receiver Ri needs to obtain bit xi and has prior side information about x. In this report, we study the minimum length of linear index codes that is characterized by a measure on graphs, called the minrank.
منابع مشابه
Noisy Index Coding with Quadrature Amplitude Modulation (QAM)
This paper discusses noisy index coding problem over Gaussian broadcast channel. We propose a technique for mapping the index coded bits to M-QAM symbols such that the receivers whose side information satisfies certain conditions get coding gain, which we call the QAM side information coding gain. We compare this with the PSK side information coding gain, which was discussed in [1]. Keywords—In...
متن کاملNoisy Index Coding with PSK and QAM
Noisy index coding problems over AWGN channel are considered. For a given index coding problem and a chosen scalar linear index code of length N , we propose to transmit the N index coded bits as a single signal from a 2 PSK constellation. By transmitting the index coded bits in this way, there is an N/2 fold reduction in the bandwidth consumed. Also, receivers with side information satisfying ...
متن کاملA Sparse and Low-Rank Optimization Framework for Index Coding via Riemannian Optimization
Side information provides a pivotal role for message delivery in many communication scenarios to accommodate increasingly large data sets, e.g., caching networks. Although index coding provides a fundamental modeling framework to exploit the benefits of side information, the index coding problem itself still remains open and only a few instances have been solved. In this paper, we propose a nov...
متن کاملEquivalences Between Network Codes With Link Errors and Index Codes With Side Information Errors
In this paper, new equivalence relationships between a network code with link errors (NCLE) and an index code with side information errors (ICSIE) are studied. First, for a given network coding instance, the equivalent index coding instance is derived, where an NCLE is converted to the corresponding ICSIE and vice versa. Next, for a given index coding instance, the equivalent network coding ins...
متن کاملOn Locally Decodable Index Codes
Index coding achieves bandwidth savings by jointly encoding the messages demanded by all the clients in a broadcast channel. The encoding is performed in such a way that each client can retrieve its demanded message from its side information and the broadcast codeword. In general, in order to decode its demanded message symbol, a receiver may have to observe the entire transmitted codeword. Que...
متن کاملOptimal Index Codes via a Duality between Index Coding and Network Coding
In Index Coding, the goal is to use a broadcast channel as efficiently as possible to communicate information from a source to multiple receivers which can possess some of the information symbols at the source as side-information. In this work, we present a duality relationship between index coding (IC) and multiple-unicast network coding (NC). It is known that the IC problem can be represented...
متن کامل